The Decidability of Simultaneous RigidE - Uni cation with One
نویسندگان
چکیده
We show that simultaneous rigid E-uniication, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classiication of decidability of the prenex fragment of intuitionistic logic with equality, in terms of the quantiier preex. It is also proved that SREU with one variable and a constant bound on the number of rigid equations is P-complete.
منابع مشابه
The Decidability of Simultaneous Rigid E-Uni cation with One Variable
We show that simultaneous rigid E-uni cation, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classi cation of decidability of the prenex fragment of intuitio...
متن کاملMonadic Simultaneous Rigid E-Uni cation and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.
متن کاملDecidability and Complexity of Simultaneous Rigid E-Uni cation with One Variable and Related Results
We show that simultaneous rigid E-uni cation, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the 8 98 fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the 99-fragment, we obtain a complete classi cation of decidability of the prenex fragment of intuitio...
متن کاملSyntactic Uni cation Problems under Constrained Substitutions
Some kind of practical problems such as security veri cation of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, uni cation problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational ...
متن کاملMonadic Simultaneous Rigid E-Unification and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. 1 Section
متن کامل